Finite Differencing of Computable Expressions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finite Differencing on the Sphere

We describe a finite difference version of the eth formalism, which allows use of spherical coordinates in 3-dimensional systems with global second order accuracy. We briefly present the application of the formalism to the evolution of linear scalar waves and to the calculation of the curvature scalar of a curved geometry on a topologically spherical manifold.

متن کامل

Computable categoricity of trees of finite height

We characterize the structure of computably categorical trees of finite height, and prove that our criterion is both necessary and sufficient. Intuitively, the characterization is easiest to express in terms of isomorphisms of (possibly infinite) trees, but in fact it is equivalent to a Σ3-condition. We show that all trees which are not computably categorical have computable dimension ω. Finall...

متن کامل

Computable Categoricity of Graphs with Finite Components

A computable graph is computably categorical if any two computable presentations of the graph are computably isomorphic. In this paper we investigate the class of computably categorical graphs. We restrict ourselves to strongly locally finite graphs; these are the graphs all of whose components are finite. We present a necessary and sufficient condition for certain classes of strongly locally f...

متن کامل

Finite Computable Dimension and Degrees of Categoricity

We first give an example of a rigid structure of computable dimension 2 such that the unique isomorphism between two non-computably isomorphic computable copies has Turing degree strictly below 0′′, and not above 0′. This gives a first example of a computable structure with a degree of categoricity that does not belong to an interval of the form [0(α),0(α+ 1)] for any computable ordinal α. We t...

متن کامل

Analytic Functions Computable by Finite State Transducers

We show that the only analytic functions computable by finite state transducers in sofic Möbius number systems are Möbius transformations.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Programming Languages and Systems

سال: 1982

ISSN: 0164-0925,1558-4593

DOI: 10.1145/357172.357177